ENSURING TERMINATION OF DIFFUSING COMPUTATIONS IN NETWORKS WITH MESSAGE LOSS pdfauthor

Diffusing computations are an important class of algorithms for distributed systems. A diffusing computation begins when any node in the network designated as the initiator passes information onto its immediate neighbors. On receiving this information each neighbor of the initiator remembers the source and in turn passes on this information to their neighbors. When a non initiator node does not have any neighbor to send information to, or when it has heard information from all its neighbors, it reports back to its source. In this fashion, diffusing computations spread from the initiator to the edge of the network and converges back to the initiator. The initiator does not have any source, therefore when the initiator hears information from all its immediate neighbors, the diffusing computation is said to have terminated. Numerous distributed applications rely on detecting termination of a diffusing computation to ensure correct operation. For example, consider a wireless anywhere classroom setting in which the instructor and students form an ad hoc network using their laptops and PDAs. Using this network, a class assignment may be distributed among all students. Students complete the assignment, and then turn in their homework by the same means. All students must submit their assignments before the instructor opens up the discussion of the solution. This again entails the reliance on detecting termination of